Generalized vec trick for fast learning of pairwise kernel models

نویسندگان

چکیده

Pairwise learning corresponds to the supervised setting where goal is make predictions for pairs of objects. Prominent applications include predicting drug-target or protein-protein interactions, customer-product preferences. In this work, we present a comprehensive review pairwise kernels, that have been proposed incorporating prior knowledge about relationship between Specifically, consider standard, symmetric and anti-symmetric Kronecker product metric-learning, Cartesian, ranking, as well linear, polynomial Gaussian kernels. Recently, O(nm + nq) time generalized vec trick algorithm, n, m, q denote number pairs, drugs targets, was introduced training kernel methods with kernel. This significant improvement over previous O(n^2) methods, since in most real-world m,q << n. work show how all reviewed kernels can be expressed sums products, allowing use speeding up their computation. experiments, demonstrate approach allows scaling much larger data sets than previously feasible, provide an extensive comparison on biological interaction prediction tasks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Kronecker Product Kernel Methods via Generalized Vec Trick.

Kronecker product kernel provides the standard approach in the kernel methods' literature for learning from graph data, where edges are labeled and both start and end vertices have their own feature representations. The methods allow generalization to such new edges, whose start and end vertices do not appear in the training data, a setting known as zero-shot or zero-data learning. Such a setti...

متن کامل

Metric learning pairwise kernel for graph inference

Much recent work in bioinformatics has focused on the inference of various types of biological networks, representing gene regulation, metabolic processes, protein-protein interactions, etc. A common setting involves inferring network edges in a supervised fashion from a set of high-confidence edges, possibly characterized by multiple, heterogeneous data sets (protein sequence, gene expression,...

متن کامل

Fast Neighborhood Subgraph Pairwise Distance Kernel

We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius at increasing distances. We show that using a fast graph invariant we obtain significant speed-ups in the Gram matrix computation. Finally, we test the novel kernel on a wide range of chemoinformatics tasks, from anti...

متن کامل

The Kernel Trick for Distances

A method is described which, like the kernel trick in support vector machines (SVMs), lets us generalize distance-based algorithms to operate in feature spaces, usually nonlinearly related to the input space. This is done by identifying a class of kernels which can be represented as norm-based distances in Hilbert spaces. It turns out that common kernel algorithms, such as SVMs and kernel PCA, ...

متن کامل

Kernel Reparametrization Trick

While deep neural networks have achieved state-of-the-art performance on many tasks across varied domains, they still remain black boxes whose inner workings are hard to interpret and understand. In this paper, we develop a novel method for efficiently capturing the behaviour of deep neural networks using kernels. In particular, we construct a hierarchy of increasingly complex kernels that enco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Machine Learning

سال: 2022

ISSN: ['0885-6125', '1573-0565']

DOI: https://doi.org/10.1007/s10994-021-06127-y